An Abstract Module Concept for Graph Transformation Systems
نویسندگان
چکیده
منابع مشابه
DIEGO, another step towards a module concept for graph transformation systems
DIEGO module systems ooer means for DIstributed programming with Encapsulated Graph Objects. Their operational semantics deenition follows the lines of distributed graph transformation, thereby permitting the speciication of distributed systems with concurrently interacting objects. Adapting previously made proposals for a graph grammar module concept and for graph models with information hidin...
متن کاملClassification and Comparison of Module Concepts for Graph Transformation Systems
In this chapter we use a three-level approach for analyzing module concepts for graph transformation systems. Based on the observation that module architectures consist of basic speciications like body or export interface and relations like the implementation relation between them, or the import relation between a client and a server module, module concepts are characterized by answering the qu...
متن کاملASTRA: A Tool for Abstract Interpretation of Graph Transformation Systems
We describe ASTRA (see http://rw4.cs.uni-saarland.de/ ~rtc/astra/), a tool for the static analysis of infinite-state graph transformation systems. It is based on abstract interpretation and implements cluster abstraction, i.e., it computes a finite overapproximation of the set of reachable graphs by decomposing them into small, overlapping clusters of nodes. While related tools lack support for...
متن کاملAbstract Graph Transformation
Graph Transformation Arend Rensink Department of Computer Science, University of Twente [email protected] Dino Distefano Department of Computer Science, Queen Mary University of London [email protected] January 31, 2005 Abstract Graphs may be used as representations of system states in operational semantics and model checking; in the latter context, they are being investigated as an alte...
متن کاملGraph Abstraction and Abstract Graph Transformation
Many important systems like concurrent heap-manipulating programs, communication networks, or distributed algorithms are hard to verify due to their inherent dynamics and unboundedness. Graphs are an intuitive representation of states of these systems, where transitions can be conveniently described by graph transformation rules. We present a framework for the abstraction of graphs supporting a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2004
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)00211-7